On pruning with the MDL Score
نویسندگان
چکیده
منابع مشابه
ON PRUNING WITH THE MDL SCORE On Pruning with the MDL Score
The space of Bayesian network structures is forbiddingly large and hence numerous techniques have been developed to prune this search space, but without eliminating the optimal structure. Such techniques are critical for structure learning to scale to larger datasets with more variables. Prior works exploited properties of the MDL score to prune away large regions of the search space that can b...
متن کاملOn Pruning with the MDL Score
The space of Bayesian network structures is forbiddingly large and hence numerous techniques have been developed to prune this search space, but without eliminating the optimal structure. Such techniques are critical for structure learning to scale to larger datasets with more variables. Prior works exploited properties of the MDL score to prune away large regions of the search space that can b...
متن کاملPruning Regression Trees with MDL
Pruning is a method for reducing the error and complexity of induced trees. There are several approaches to pruning decision trees, while regression trees have attracted less attention. We propose a method for pruning regression trees based on the sound foundations of the MDL principle. We develop coding schemes for various constructs and models in the leaves and empirically test the new method...
متن کاملMDL-Based Decision Tree Pruning
This paper explores the application of the Min imum Description Length principle for pruning decision trees We present a new algorithm that intuitively captures the primary goal of reduc ing the misclassi cation error An experimental comparison is presented with three other prun ing algorithms The results show that the MDL pruning algorithm achieves good accuracy small trees and fast execution ...
متن کاملImproved MDL Score for Learning of Bayesian Networks
In this paper, we propose two modifications to the original Minimum Description Length (MDL) score for learning of Bayesian networks. The first modification is that the description of network structure is proved to be unnecessary and can be omitted in the total MDL score. The second modification consists in reducing the description length of conditional probability table (CPT). In particular, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2018
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.10.023